Quantization as Selection Rather than Eigenvalue Problem
نویسنده
چکیده
منابع مشابه
Hyperplane Design in Observer-based Discrete-time Sliding Mode Control Hyperplane Design in Observer-based Discrete-time Sliding Mode Control
A new result that allows the selection of sliding hyperplane coeecients in Observer-Based Discrete-Time Sliding Mode Control (OBDSMC) is presented. Selection of co-eecients is done by analyzing the tracking error dynamics inside the boundary layer-where the closed-loop system has a linear state feedback connguration-rather than assuming that the sliding function has already converged to zero. T...
متن کاملEvolution of the first eigenvalue of buckling problem on Riemannian manifold under Ricci flow
Among the eigenvalue problems of the Laplacian, the biharmonic operator eigenvalue problems are interesting projects because these problems root in physics and geometric analysis. The buckling problem is one of the most important problems in physics, and many studies have been done by the researchers about the solution and the estimate of its eigenvalue. In this paper, first, we obtain the evol...
متن کاملMEAN-ABSOLUTE DEVIATION PORTFOLIO SELECTION MODEL WITH FUZZY RETURNS
In this paper, we consider portfolio selection problem in which security returns are regarded as fuzzy variables rather than random variables. We first introduce a concept of absolute deviation for fuzzy variables and prove some useful properties, which imply that absolute deviation may be used to measure risk well. Then we propose two mean-absolute deviation models by defining risk as abs...
متن کاملDesign of IIR digital allpass filters based on eigenvalue problem
A new method is proposed for designing IIR digital allpass filters with an equiripple phase response that can be proven to be optimal in the Chebyshev sense. The proposed procedure is based on the formulation of an eigenvalue problem by using the Remez exchange algorithm. Since there exists more than one eigenvalue in the general eigenvalue problem, we introduce a new and very simple selection ...
متن کاملCompression algorithm for discrete light-cone quantization.
We adapt the compression algorithm of Weinstein, Auerbach, and Chandra from eigenvectors of spin lattice Hamiltonians to eigenvectors of light-front field-theoretic Hamiltonians. The latter are approximated by the standard discrete light-cone quantization technique, which provides a matrix representation of the Hamiltonian eigenvalue problem. The eigenvectors are represented as singular value d...
متن کامل